# n = int(input())
# arr = list(map(int, input().split(" ")))
# #计算两条垂线的面积 (right - left) * min(height[right], height[left])

# max_s = 0
# for i in range(len(arr) - 1):
#     for j in range(i + 1, len(arr)):
#         s = (j - i) * min(arr[j], arr[i])
#         if s > max_s:
#             s, max_s = max_s, s
# print(max_s)


# def solve(arr):
#     left = 0
#     right = len(arr) - 1
#     max_s = 0
#     while left < right:
#         s = (right - left) * min(arr[right], arr[left])
#         if max_s < s:
#             max_s, s = s, max_s
#         if arr[right] > arr[left]:
#             left += 1
#         else:
#             right -= 1
#     return max_s


# n = int(input())
# arr = list(map(int, input().split(" ")))
# print(solve(arr))

# def solve(matrix):
#     #定义出上下左右边界
#     top, bottom = 0, len(matrix) - 1
#     left, right = 0, len(matrix[0]) - 1
#     result = []
#     while top <= bottom and left <= right:
#         #从左到右遍历
#         for i in range(left, right + 1):
#             result.append(matrix[top][i])
#         top += 1
#         #从上到下遍历
#         for i in range(top, bottom + 1):
#             result.append(matrix[i][right])
#         right -= 1
#         #如果还有行从右往左
#         if top <= bottom:
#             for i in range(right, left - 1, -1):
#                 result.append(matrix[bottom][i])
#             bottom -= 1
#         #如果还有列从右往左
#         if left <= right:
#             for i in range(bottom, top - 1, -1):
#                 result.append(matrix[i][left])
#             left += 1
#     return result


# row, col = map(int, input().split(" "))
# matrix = []
# for i in range(row):
#     rows = list(map(int, input().split(" ")))
#     matrix.append(rows)

# print(solve(matrix))
#探索二维矩阵

# def search(arr, target):
#     left = 0
#     right = len(arr) - 1
#     while True:
#         mid = (left + right) // 2
#         if target > arr[mid]:
#             left = mid + 1
#         elif target < arr[mid]:
#             right = mid - 1
#         else:
#             return True
#         if left > right:
#             return False

# def solve(matrix, target):
#     for i in range(len(matrix)):
#         if matrix[i][0] <= target <= matrix[i][len(matrix[i]) - 1]:
#             if search(matrix[i], target):
#                 return True
#     return False
    

# row, col, target = map(int, input().split(" "))
# matrix = []
# for i in range(row):
#     rows = list(map(int, input().split(" ")))
#     matrix.append(rows)

# print(solve(matrix, target))

#最长连续递增序列
#失败版
# def is_lianxu(sub):
#     for i in range(len(sub) - 1):
#         for j in range(i + 1, len(sub)):
#             if sub[i] > sub[j]:
#                 return False
#     return True

# n = int(input())
# arr = list(map(int, input().split(" ")))
# for i in range(n):
#     sub = []
#     for j in range(i, n):
#         sub.append(arr[j])
#     if is_lianxu(sub):
#         print(sub, len(sub))
#         break
        
# n = int(input())
# arr = list(map(int, input().split(" ")))

# max_length = 1
# cur_length = 1
# for i in range(n - 1):
#     if arr[i] <= arr[i + 1]:
#         cur_length += 1
#         if max_length < cur_length:
#             max_length = cur_length
#     else:
#         cur_length = 1
# print(max_length)

# s = "abc"
# print(len(s))
#字符串
# s = "abcd"
# print(s[0])
# s[0] = 'A'

# s = "123abcdefg"
# print(s.upper())
# print(s)
# s1 = "642aBCDEF"
# print(s1.lower())
# s3 = "abcdF,abcde"
# print(s3.capitalize())

# s4 = "oNE,tWO"
# print(s4.title())

# s5 = "abcdefGHIJKLMN"
# print(s5.swapcase())
s1 = "my name is lei jin bao and lei jin bao is da shuai ge"
# print(s1.find("lei jin bao"))
# print(s1.rfind("lei jin bao"))
# print(s1.rindex("lei jin bao"))
# # print(s1.index("leijin bao"))
# print(s1.count('i'))
# print(s1.replace('i', 'H', 2))
# s1 = "$$$          lei jin bao is da shuai ge           $$$"
# s2 = s1.lstrip("$")
# s3 = s1.rstrip("$")
# print(f'[{s1.strip("$")}]')
# print(f'[{s2}]')
# print(f'[{s3}]')
# s1 = "   my name is bob   "
# s2 = s1.strip()
# print(f"[{s2}]")
# s3 = "###my name is bob###"
# s2 = s3.strip("#")
# print(f"[{s2}]")

# s = "1 2 3 4 5  6 7 8"
# # arr = s.split(" ", maxsplit = 3 )
# s = "1\t2 \t3\t4\t5\t6"
# arr = s.split()
# print(arr)
# s = """
# 鹅，鹅，鹅
# 曲项向天歌
# 白毛浮绿水
# 红掌拨清波
# """
# s = "Apple\nBanana\nOrange\nPear"
# print(s)
# arr = s.splitlines(True)
# print(arr)
# arr1 = ["computer", "refrigerator", "graph", "Machine Learning"]
# arr1 = [1, 2, 3, 4, 5, 6, 7, 8, 9]
# print("+" .join(str(i) for i in arr1))
# print("+" .join([str(i) for i in arr1]))
# print("+".join(map(str, arr1)))
# s = "789avi"
# print(s.startswith("迪"))
# print(s.endswith('v'))
# print(s.isalnum())
arr1 = [chr(i) for i in range(97, 123)]
print(arr1)
arr2 = [ ord(i) for i in arr1]
print(arr2)